A Limit Evolution Problem for Time-Dependent Point Interactions
نویسندگان
چکیده
منابع مشابه
A Time Dependent Pollution Routing Problem in Multi-graph
This paper considers a time dependent(the travel time is not constant throughout the day) pollution routing problem (TDPRP), which aids the decision makers in minimizing travel time, toll cost and emitted pollution cost. In complexity of urban areas most of the time one point is accessible from another with more than one edge. In contrast to previous TDPRP models, which are designed with only ...
متن کاملA time-dependent vehicle routing problem for disaster response phase in multi-graph-based network
Logistics planning in disaster response phase involves dispatching commodities such as medical materials, personnel, food, etc. to affected areas as soon as possible to accelerate the relief operations. Since transportation vehicles in disaster situations can be considered as scarce resources, thus, the efficient usage of them is substantially important. In this study, we provide a dynamic vehi...
متن کاملAn isoperimetric problem for point interactions
Questions about geometrical configurations which lead to extremal value of a spectral quantity represent a classical topic in mathematical physics; recall the Faber-Krahn inequality [Fa, Kr], the PPW-conjecture proved by Ashbaugh and Benguria [AB], and numerous other examples. A particular place in this list is occupied by the Dirichlet problem for the Laplacian in annular strips and their high...
متن کاملOn time-dependent neutral stochastic evolution equations with a fractional Brownian motion and infinite delays
In this paper, we consider a class of time-dependent neutral stochastic evolution equations with the infinite delay and a fractional Brownian motion in a Hilbert space. We establish the existence and uniqueness of mild solutions for these equations under non-Lipschitz conditions with Lipschitz conditions being considered as a special case. An example is provided to illustrate the theory
متن کاملAN ANT COLONY SYSTEM ALGORITHM FOR THE TIME DEPENDENT NETWORK DESIGN PROBLEM
Network design problem is one of the most complicated and yet challenging problems in transportation planning. The Bi-level, non-convex and integer nature of network design problem has made it into one of the most complicated optimization problems. Inclusion of time dimension to the classical network design problem could add to this complexity. In this paper an Ant Colony System (ACS) has been ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Functional Analysis
سال: 1996
ISSN: 0022-1236
DOI: 10.1006/jfan.1996.0149